An analysis of parameter adaptation in reactive tabu search

On-line parameter adaptation schemes are widely used in metaheuristics. They are sometimes preferred to off-line tuning techniques for two main reasons. First, they promise to achieve good performance even on new instance families that have not been considered during the design or the tuning phase of the algorithm. Second, it is assumed that an on-line scheme could adapt the algorithm’s behaviour to local characteristics of the search space. This paper challenges this second hypothesis by analysing the contribution of the parameter adaptation to the performance of a state-of-the-art Reactive Tabu Search algorithm for the Maximum Clique Problem. Our experimental analysis shows that this on-line parameter adaptation scheme converges to good instance-specific settings for the parameters, and that there is no evidence that it adapts to the local characteristics of the search space. The insights gained from the analysis are confirmed by further experiments with a Reactive Tabu Search algorithm for the Quadratic Assignment Problem. Together, the results on the two algorithms shed some new light on the reasons behind the effectiveness of Reactive Tabu Search.